Class number approximation in cubic function fields

نویسندگان

  • Renate Scheidler
  • Andreas Stein
چکیده

A central problem in number theory and algebraic geometry is the determination of the size of the group of rational points on the Jacobian of an algebraic curve over a finite field. This question also has applications to cryptography, since cryptographic systems based on algebraic curves generally require a Jacobian of non-smooth order in order to foil certain types of attacks. There a variety of methods for accomplishing this task; some are general, while others are only applicable to specific types of curves. In the interest of space, we forego citing most the large volume of literature on elliptic and hyperelliptic curves in detail, and mention only two sources. Kedlaya’s padic algorithm for hyperelliptic curves [23, 24] is particularly well-suited to fields of small characteristic and has since been extended to Artin-Schreier extensions [14, 26, 27], superelliptic curves [17, 28], Cab curves [15], and more general curves [18, 13]; see also the survey by Kelaya [25]. A very different approach was first given by Schoof for elliptic curves [37]; this method was generalized to Abelian varieties by Pila [30, 31] and improved by Adleman and Huang [1, 2]. The Adleman-Huang algorithm computes the characteristic polynomial of the Frobenius endomorphism of an Abelian variety of dimension d in projective N -space over a finite field Fq in time O(log(q)δ) where δ depends polynomially on d and N . For plane curves

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kummer, Eisenstein, Computing Gauss Sums as Lagrange Resolvents

In fact, [Eisenstein 1850] evaluated cubes and fourth powers of Gauss sums attached to cubic and quartic characters to prove the corresponding reciprocity laws. One essential point is the p-adic approximation of Gauss sums by [Kummer 1847], generalized in [Stickelberger 1890]. Since the rings of algebraic integers generated by third or fourth roots of unity have class number one and finitely-ma...

متن کامل

A Lower Bound for the Class Number of Certain Cubic Number Fields

Let AT be a cyclic number field with generating polynomial i a— 3 ^ û + 3 x3 —Y-x1 -=~-xi and conductor m. We will derive a lower bound for the class number of these fields and list all such fields with prime conductor m = (a1 + 21)/A or m = (1 + 21b2)/A and small class number.

متن کامل

Number fields with large class groups

After a review of the quadratic case, a general problem about the existence of number fields of a fixed degree with extremely large class numbers is formulated. This problem is solved for abelian cubic fields. Then some conditional results proven elsewhere are discussed about totally real number fields of a fixed degree, each of whose normal closure has the symmetric group as Galois group.

متن کامل

Upper bounds for residues of Dedekind zeta functions and class numbers of cubic and quartic number fields

Let K be an algebraic number field. Assume that ζK(s)/ζ(s) is entire. We give an explicit upper bound for the residue at s = 1 of the Dedekind zeta function ζK(s) of K. We deduce explicit upper bounds on class numbers of cubic and quartic number fields.

متن کامل

Research Statement and Plan

My main research interest is number theory, in particular algebraic and computational number theory. Specifically, I am interested in computational aspects of number fields and function fields, in particular field tabulation and efficient computation of invariants associated with number fields and function fields. Many problems in this area have been explored extensively in the case of number f...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Contributions to Discrete Mathematics

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2007